Usage of graph patterns for concept map extension
نویسندگان
چکیده
منابع مشابه
A Comparative Study of Conceptual Graph and Concept Map
The purpose of this paper is to compare two types of graphical models that are widely being used nowadays. The models are called conceptual graph and concept map. Although the names of these models are similar, however, the characteristics of each model are different. A number of 18 papers are compared and important elements for these models are discussed in these papers. This paper is divided ...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولThe Effect of Concept Map on Education: A Systematic Review
Introduction: Along with science and technology advancement, philosophy, content and educational methods are transforming. Modern approaches such as constructivism have replaced traditional approaches and the assumption of knowledge transfer from teachers to learners. One of these approaches is concept map. The purpose of this paper was to examine the application of concept maps in education an...
متن کاملUsage of ‘provenance’: A Tower of Babel Towards a concept map
At the recent International Provenance and Annotation Workshop [MF06], during a Gong Show of outlandish, “outside-the-box” ideas, I presented an analysis of the use of the word ‘provenance’ in some of the 28 preprints selected for presentation. Over 1100 occurrences of the word ‘provenance’ were identified, and out of these, 124 different usages were extracted. As will be shown in this position...
متن کاملExtension of Graph-Based Induction for General Graph Structured Data
A machine learning technique called Graph-Based Induction (GBI) e ciently extracts typical patterns from directed graph data by stepwise pair expansion (pairwise chunking). In this paper, we expand the capability of the Graph-Based Induction to handle not only tree structured data but also multi-inputs/outputs nodes and loop structure (including a self-loop) which cannot be treated in the conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Computer Systems
سال: 2012
ISSN: 2255-8691
DOI: 10.2478/v10312-012-0005-3